Algorithms for Omega-Regular Games with Imperfect Information
نویسندگان
چکیده
منابع مشابه
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turnbased games on graphs with omega-regular objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixe...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò Algorithms for Omega-regular Games with Imperfect Information
We study observation-based strategies for two-player turnbased games on graphs with omega-regular objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixe...
متن کاملAlgorithms for Omega-Regular Games with Incomplete Information
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on incomplete information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a f...
متن کاملAsynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a general model, a standard synchronous and an asynchronous one. In the asynchronous setting, moves which have no visible effect for a player are hidden completely from
متن کاملGames with Imperfect Information: Theory and Algorithms
We study observation-based strategies for two-player turnbased games played on graphs with parity objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2007
ISSN: 1860-5974
DOI: 10.2168/lmcs-3(3:4)2007